On Multidimensional Arrays of Processors

نویسنده

  • Mikhail J. Atallah
چکیده

We investigate the relationship between an arbitrary d -dil!1ensional mesh of n processors. and one all of whose dimensions have equal length. We give optimal simulation algorithms between these two models. keywords: Analysis of AIgorithffis. Mesh-Connected Processor Arrays, Parallel Computation This work was supported by the Office of Naval Research under Conlract NOOO14-84.K.0502.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reduction of CRB in Arbitrary Pre-designed Arrays Using Alter an Element Position

Simultaneous estimation of range and angle of close emitters usually requires a multidimensional search. This paper offers an algorithm to improve the position of an element of any array designed on the basis of some certain or random rules. In the proposed method one element moves on its original direction, i.e., keeping the vertical distance to each source, to reach the constellation with les...

متن کامل

Parallelization of Linearized Applications in Fortran D

The Fortran D language extends Fortran by permitting the user to specify the distribution of array variables across the processors of a parallel computer system. This information can then be used by the compiler to derive a multidimensional parallelization. For programs in which multidimensional arrays have been linearized for optimal performance on vector processors, this strategy will not pro...

متن کامل

How to Synchronize Large-Scale Ultra-Fine-Grained Processors in Optimum-Time

Abstract—We introduce a new class of FSSP (firing squad synchronization problem) algorithms based on recursive-halving and construct a survey on recent developments in FSSP algorithms for one-dimensional cellular arrays. We present herein a comparison of the quantitative aspects of the optimum-time FSSP algorithms developed so far. Several state-efficient new implementations and new insights in...

متن کامل

Efficient Multidimensional Data Redistribution for Resizable Parallel Computations

Traditional parallel schedulers running on cluster supercomputers support only static scheduling, where the number of processors allocated to an application remains fixed throughout the execution of the job. This results in underutilization of idle system resources thereby decreasing overall system throughput. In our research, we have developed a prototype framework called ReSHAPE, which suppor...

متن کامل

Supporting multidimensional arrays in Java

The lack of direct support for multidimensional arrays in JavaTM has been recognized as a major deficiency in the language’s applicability to numerical computing. It has been shown that, when augmented with multidimensional arrays, Java can achieve very high-performance for numerical computing through the use of compiler techniques and efficient implementations of aggregate array operations. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 37  شماره 

صفحات  -

تاریخ انتشار 1988